Assertion is weak

Weak Arithmetic Completeness of Object-Oriented First-Order Assertion Networks

We present a completeness proof of the inductive assertion method for object-oriented programs extended with auxiliary variables. The class of programs considered are assumed to compute over structures which include the standard interpretation of Presburger arithmetic. Further, the assertion language is first-order, i.e., quantification only ranges over basic types like that of the natural numb...

Assertion: Prefetching With GET is Not Good

The benefits of Web cache prefetching are well understood, and so prefetching has been implemented in a number of commercial products. This paper argues that the current support for prefetching in HTTP/1.1 is insufficient because prefetching with GET is not good. Existing prefetching implementations can cause problems with undesirable side-effects and server abuse, and the potential for these p...

How weak is weak extent ?

We show that the extent of a Tychonoff space of countable weak extent can be arbitrary big. The extent of X is e(X) = sup{|F | : F ⊂ X is closed and discrete} while we(X) = min{τ : for every open cover U of X there is A ⊂ X such that |A| ≤ τ and St(A,U) = X} is the weak extent of X (also called the star-Lindelöf number of X). Also we show that the extent of a normal space with countable weak ex...

Understanding Assertion

In What Sense Is Knowledge the Norm of Assertion?

The knowledge account of assertion (KAA) is the view that assertion is governed by the norm that the speaker should know what s/he asserts. It is not the purpose of this article to examine all these criticisms nor to try to give a full defence of KAA, but only to defend it against the charge of being normatively incorrect It has been objected that assertion is governed by other norms than knowl...